Techniques for payment-based network transmissions

ABSTRACT

Techniques and apparatus for providing payment-based transmission processes are described. In one embodiment, for example, a network node may include a storage device, and logic, at least a portion of the logic implemented in circuitry coupled to the storage device. The logic may operate to provide a routing query to transmit information over a network, the routing query comprising at least one destination node for the information and a transmission value, receive at least one bid from at least one bidding node in response to the routing query, determine a path through the network to transmit the information anonymously based on the at least one bid that corresponds to the transmission value, and transmit the information at least partially anonymously via the path within a network packet encrypted in a number of layers of encryption corresponding to a number of intermediary nodes in the path. Other embodiments are described.

RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.16/730,548, entitled “TECHNIQUES FOR PAYMENT-BASED NETWORKTRANSMISSIONS” filed on Dec. 30, 2019. The contents of theaforementioned application are incorporated herein by reference.

TECHNICAL FIELD

Embodiments herein generally relate to network communications and, moreparticularly, to processes for implementing payment-based networktransmissions.

BACKGROUND

Increasing attention to network monitoring capabilities used by variousorganizations has caused users to seek improved online privacy on datanetworks, such as the Internet. Due to concern for their privateinformation, certain users have turned to anonymous networks thatoperate to conceal user information, such as sender information,destination information, network addresses, device information, locationinformation, and/or the like. Conventional anonymous platforms haveoperated to secure data packets in layers of encryption based on variousfactors, such as the number of hops that the packet takes over acommunication path. Although existing systems have been able to increasethe anonymity of users, they lack systems capable of maintaining certainnetwork functions, particularly in a private manner. For example,current anonymous networks are not capable of providing networkprocessing or routing payment functions while ensuring payments andpayment information remain secure from public access.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an embodiment of a first operating environment.

FIG. 2A illustrates an embodiment of a second operating environment.

FIG. 2B illustrates embodiments of a transmission path according to someembodiments.

FIG. 3 illustrates an embodiment of a first logic flow.

FIG. 4 illustrates an embodiment of a second logic flow.

FIG. 5 illustrates an embodiment of a third logic flow.

FIG. 6 illustrates a logical model of a blockchain.

FIG. 7 illustrates a logical model of a message stored in the blockchainof FIG. 6.

FIG. 8 illustrates a storage medium.

FIG. 9 illustrates a computing architecture.

DETAILED DESCRIPTION

Various embodiments may generally be directed toward systems, methods,and/or apparatus for implementing a payment-based transmission network(or “network”). In some embodiments, the payment-based transmissionnetwork may implement anonymous communications and/or data transmissionpayments. In various embodiments, the payment-based transmission networkmay include a plurality of computing nodes (or “nodes”) at least aportion of which operate to perform various aspects of a transmissionpayment process. In some embodiments, a transmission payment process mayoperate to facilitate the anonymous payment by originating nodes fortransmitting data over the payment-based transmission network to adestination node.

For example, an originating node may have or be associated with data(for instance, information, files, packets, network traffic, or thelike) that needs to be routed over the network to a destination node.The originating node may broadcast or otherwise communicate a price orvalue that the sender is willing to expend to transmit the data to reachthe destination node. Bidding or intermediary nodes on the network mayreceive the request and respond with a bid that the bidding noderequires to transmit the data along their segment of the path from theoriginating node to the destination node. The originating node mayselect among one or more paths that meet the requested price fortransmission of the data to the destination nodes.

In some embodiments, the network may be or may include an encryptednetwork in which transmitted data is encrypted. In various embodiments,the network may operate as an anonymous encrypted network implementinglayered encryption the same or similar to “onion routing” (see, forexample, Reed et al. titled, “Anonymous connections and onion routing,”IEEE Journal on Selected Areas in Communications, 1998, 16(4), pp.482-494), for instance, implemented according to the Tor network. Inonion routing, a packet or other information element may be encrypted ina number of encryption layers for each node or hop along the path fromthe originating node to the destination node. One layer is decrypted ateach node or hop to reveal the information elements next node on itspath to the destination node. Accordingly, onion routing communicationsmay be anonymous because each intermediate node only knows theinformation relating to the immediately preceding and following nodes.

In various embodiments, the data may be encrypted by the originatingnode using onion routing. For example, if the selected path includesthree bidding or intermediary nodes, the originating node may encryptthe data and the payment in three layers of encryption (or four, one foreach intermediary node and one for the destination node). The encryptedpacket may be transmitted by the originating node to the firstintermediary node. The first intermediary node may decrypt the firstlayer of decryption, take its share of the payment, and route theencrypted packet (now with two layers of encryption) to the secondintermediate node, and so on until the packet reaches the destinationnode. In general, all nodes submitting bids may be labeled as biddingnodes; bidding nodes that are in the accepted path may be labeled asintermediary nodes as they will be performing as intermediaries betweenthe originating node and the destination node.

Payment-based transmission processes, according to some embodiments, mayprovide multiple technological advantages, including improvements tocomputing technology, over conventional systems and methods. Onenon-limiting example of a technological advantage may includeincentivizing network users to become nodes of a network by providingpayments to network nodes. More nodes in a network may provide for moreencryption and, therefore, increased security and anonymity. Anothernon-limiting example of a technological advantage may include providinga process to allow users to pay for increased encryption. A furthernon-limiting example of a technological advantage may include providingprocesses for secure, anonymous data transmission payments. In addition,embodiments may provide technological advantages over conventionalnetworks, including anonymous networks such as Tor. For example, Tor andsimilar networks have several major disadvantages, including attacks dueto the limited number of nodes. Processing according to some embodimentsmay allow for traffic to be anonymous at varying levels, ensurespayment, optimize the number of possible nodes and can make bothanonymous payments and web traffic fixing the end-to-end correlationproblem of existing onion routing networks, for example, because everynetwork device may be a node.

In this description, numerous specific details, such as component andsystem configurations, may be set forth in order to provide a morethorough understanding of the described embodiments. It will beappreciated, however, by one skilled in the art, that the describedembodiments may be practiced without such specific details.Additionally, some well-known structures, elements, and other featureshave not been shown in detail, to avoid unnecessarily obscuring thedescribed embodiments.

In the following description, references to “one embodiment,” “anembodiment,” “example embodiment,” “various embodiments,” etc., indicatethat the embodiment(s) of the technology so described may includeparticular features, structures, or characteristics, but more than oneembodiment may and not every embodiment necessarily does include theparticular features, structures, or characteristics. Further, someembodiments may have some, all, or none of the features described forother embodiments.

As used in this description and the claims and unless otherwisespecified, the use of the ordinal adjectives “first,” “second,” “third,”etc. to describe an element merely indicate that a particular instanceof an element or different instances of like elements are being referredto, and is not intended to imply that the elements so described must bein a particular sequence, either temporally, spatially, in ranking, orin any other manner.

FIG. 1 illustrates an example of an operating environment 100 that maybe representative of some embodiments. The operating environment 100 canbe a network 110 and can include a first node 102-1, a second node102-2, a third node 102-3, a fourth node 102-4, and a fifth node 104-5node. Mesh network 110 is not limited to the number of nodes depicted inFIG. 1.

Network 110 may be or may include various types of networks, such aspeer-to-peer networks, mesh networks, and/or the like. In variousembodiments, network 110 may be a mesh network that can operateaccording to any known mesh networking protocol or standard. Although amesh network is used in this Detailed Description, embodiments are notso limited, as any type of network capable of operating according tosome embodiments is contemplated herein.

In various embodiments, data, traffic, messages, or other communicationswithin mesh network 110 can be transmitted between nodes 102 asdescribed herein. In various embodiments, data, traffic, messages, orother communications within mesh network 110 can be transmitted from aninitial node to a desired recipient node through a path formed from oneor more intermediate nodes. Mesh network 110 may provide a paymentsystem according to some embodiments within mesh network 110 that doesnot require each node 102 to be connected directly to the Internet. Invarious embodiments, one or more nodes 102 can maintain a blockchain fora cryptocurrency that can support a payment system useable within meshnetwork 110 and that can support secure communications within meshnetwork 110.

As an example, node 102-1 and node 102-5 can each be considered to be anauthorized or trusted node on mesh network 110. In some embodiments,each of nodes 102 are considered to be “authorized,” such that there arenot separate “authorized” and “unauthorized” populations of nodes. Invarious embodiments, each of nodes 102 may be “peer” nodes with the sameor essentially the same rights, functionality, access, and/or the likeon mesh network. In such a peer embodiment, each node may be capable ofperforming the functions described in reference to authorized nodes. Insome embodiments, an “authorized” node may include any node 102 ofnetwork 110 that has agreed to operate as a node. Embodiments are notlimited in this context.

One or more of the authorized nodes 102-1 and 102-5 can maintain ablockchain (see, for example, FIGS. 6 and 7) for cryptocurrency usedwithin mesh network 110. One or more of authorized nodes 102-1 and 102-5can process transactions related to the blockchain including, forexample, updating the blockchain based on a transaction and distributethe updated blockchain. Transactions can be conducted within meshnetwork 110 and can utilize the cryptocurrency blockchain maintained byone or more of nodes 102-1 and 102-5. In some embodiments, transactionsmay be or may include payment-based data transmissions. Communicationsor other messages can be transmitted within mesh network 110 usingencryption features provided by the cryptocurrency and/or blockchainsuch that the communications or other messages can be provided in asecure manner.

In an example, modes 102-2, 102-3, and 102-4 can each be considered tobe an unauthorized or untrusted node. In various embodiments, asunauthorized nodes, nodes 102-2, 102-3, and 102-4 can each routecommunications or other messages to an authorized node (e.g., nodes102-1 and 102-5) but cannot directly send messages to one another (e.g.,node 102-2 cannot directly send a message to node 102-3). In variousembodiments, as unauthorized nodes, nodes 102-2, 102-3, and 102-4 may beallowed to receive and transmit communications, messages, or othertraffic on a limited basis. In various embodiments, one or more of theauthorized nodes 102-1 and 102-5 can determine the allowed level ofparticipation on mesh network 110 by nodes 102-2, 102-3, and 102-4.

In some embodiments, external nodes 103 may be able to access portionsof mesh network 110. For example, node 103-1 may seek to transmitinformation to node 103-2. The user of node 103-1 may seek to transmitthe information anonymously and may be willing to pay a cost foranonymous transmission according to some embodiments. Accordingly, node103-1 may request to transmit the information using the payment-basedtransmission process of the mesh network 110, although node 103-1 is nota member of mesh network 110.

Path 104 can represent a communication path between certain nodes onmesh network 110 (e.g., between node 102-1 and node 102-2). Other paths104 between certain nodes are shown in FIG. 1 but are not labeled forsimplicity. The path 104 can indicate that communication between certainnodes is allowed or possible within mesh network 110. In variousembodiments, communications between authorized node 102-1 and authorizednode 102-5 can be provided through node 102-3; for example, node 102-3can relay messages between the authorized nodes 102-1 and 102-5. Invarious embodiments, a communication path is not shown between node102-3 and node 102-4 since each node is unauthorized and cannot directlysend messages to one another. Instead, nodes 102-3 and 102-4 may beallowed to perform only limited functions with respect to the meshnetwork 110 as described herein. In various other embodiments, each node102 of mesh network 110 may communicate with every other node 102 of themesh network 110.

In some embodiments, each of nodes 102 may be connected to every othernode of network 110. In other embodiments, at least a portion of nodes102 may only be connected to a limited number or region of nodes.Accordingly, network 110 may be formed as a network of connected noderegions. For example, nodes 102-1, 102-2, and 102-3 may be a first noderegion and nodes 102-4 and 102-5 may be a second node region and onlynodes 102-2 and 102-5 are communicably coupled to each other.Accordingly, in order for a data packet sent by node 102-4 to reach node102-1, the packet would have to travel along the path of node 102-4,node 102-5, node 102-2, and then node 102-1. In some embodiments, aregion of nodes may be or may include about 8-10 nodes. Embodiments arenot limited in this context.

In various embodiments, each of nodes 102 can be associated with awallet that may be associated with a value, such as units, a currency,tokens, and/or the like. For example, the wallet may be or may include acryptocurrency wallet that can be loaded with an amount ofcryptocurrency (e.g., cryptocurrency tokens). In some embodiments, forexample, authorized nodes 102-1 and 102-5 can issue the cryptocurrencywallets for the other nodes 102-2, 102-3, and 102-4. The authorizednodes 102-1 and 102-5 can also control access to the mesh network 110.As an example, the authorized nodes 102-1 and 102-5 can grant or deny arequest by another node 102 (e.g., node 102-2) to join and participateon mesh network 110. In various embodiments, only authorized nodes canbe associated with a cryptocurrency wallet.

The authorized nodes 102-1 and 102-5 can be designated as such in anumber of manners. In various embodiments, a node 102 can be consideredan authorized node 102 once it holds or stores a certain amount or valueof cryptocurrency. In various embodiment, a node 102 can be consideredan authorized node 102 once a certain number of other nodes 102 (e.g.,authorized nodes) determine node 102 should be an authorized node. Invarious embodiments, a node 102 can be considered an authorized node 102once it helps facilitate a certain number of transactions using theblockchain (e.g., helps authorize transactions based on the blockchain).In general, to become an authorized node, one or more criteria may bemet as described herein. Once a node becomes an authorized node, thenode can communicate in any manner with any other node of the meshnetwork 110, can manage the participation of other nodes on the meshnetwork including, for example, issuing cryptocurrency wallets, and canmanage a blockchain of the cryptocurrency. An authorized node canreceive payments (e.g., based on the cryptocurrency) for processingtransactions and maintaining the blockchain and can receive payments forrouting communications and other messages through mesh network 110.

In contrast, unauthorized nodes are generally limited to routingcommunications and other messages to authorized nodes. In variousembodiments, unauthorized nodes can receive payments (e.g., based on thecryptocurrency) for helping to facilitate transactions within meshnetwork 110, for example, by routing traffic carrying data related to atransaction toward an authorized node and by helping to authorize atransaction (e.g., when a desired cryptocurrency transaction requiresauthorization from multiple nodes for verification). In variousembodiments, unauthorized nodes can also receive payments for routingcommunications and other messages through mesh network 110 (e.g.,subject to any routing limitations related to operating as an authorizednode). In various embodiments, one or more of the authorized nodes 102-1and 102-5 can be connected to the Internet and/or a remote network. Invarious embodiments, the one or more of the authorized nodes 102-1 and102-5 can ensure that a maintained blockchain is up to date and accuratewith versions of the blockchain maintained outside of mesh network 110.

For purposes of illustration and explanation only, five nodes 102 areshown in FIG. 1, but the number of nodes 102 capable of operating onmesh network 110 is not so limited as any number of nodes 102 can beincluded within mesh network 110. Nodes 102 can represent any type ofelectronic and/or computing device maintained by an operator or userincluding, for example, a smartphone, a tablet, a laptop, or any otherconsumer electronic device capable of operating as a node 102 on meshnetwork 110. The operator or user of any of nodes 102 can be a privateindividual or can be a business owner or purveyor such that certainnodes 102 can represent a point of sale node (e.g., a node associatedwith the sale of a good or service). Accordingly, transactions can beconducted entirely within mesh network 110 using the blockchain betweena POS node and an individual node and/or between two individual nodes.

For purposes of discussion, operation of node 102-2 is described inrelation to joining mesh network 110 and can be applicable to any othernode 102 on mesh network 110. In various embodiments, node 102-2 canreceive data or other information relating to mesh network 110. Invarious embodiments, an application (“app” or “mobile app”) or otherprogram can be downloaded onto node 102-2. The data or other informationrelating to mesh network 110 and/or the downloaded app can be used toestablish the electronic device and/or computing device as node 102-2 onmesh network 110. Other nodes 102 can also be established on meshnetwork 110 in a similar manner. After the computing device isestablished as node 102-2 that is capable of operating on mesh network110, node 102-2 can generate a cryptocurrency wallet. The generatedcryptocurrency wallet can be stored on node 102-2, for example, within astorage device and/or memory unit of the computing device established asnode 102-2. The cryptocurrency wallet for node 102-2 can be issued by anauthorized node of the mesh network such as, for example, node 102-2 ornode 102-5.

After generating a cryptocurrency wallet, the user of the computingdevice operating as node 102-2 can load the generated cryptocurrencywallet with an amount of cryptocurrency tokens. The amount ofcryptocurrency tokens can be issued by an authorized node of the meshnetwork. As an example, node 102-2 can provide a payment to theauthorized node 102-1 in exchange for a corresponding amount of acryptocurrency (e.g., cryptocurrency tokens). Other nodes 102 of meshnetwork 110 can generate a cryptocurrency wallet and load the walletwith cryptocurrency in a similar manner. In various embodiments, onlyauthorized nodes are allowed to conduct financial transactions on meshnetwork 110. In various embodiments, unauthorized nodes are allowed toalso conduct financial transactions on mesh network 110.

As an example, the authorized node 102-1 can conduct transactions withinmesh network 110 using cryptocurrency stored in a generated wallet. Asan example, node 102-1 can initiate and conduct a transaction with node102-5 (e.g., for a good or service offered by node 102-5). Payment canbe provided by node 102-1 to node 102-5 based on cryptocurrency storedin the generated wallet of node 102-1. One or more authorized nodes,such as node 102-1, can update and manage the blockchain to reflect thetransaction between node 102-1 and node 102-5. Transactional data orinformation can be transferred between nodes 102-1 and 102-5 tofacilitate the transaction. One or more unauthorized nodes, such as node102-2, can transfer messages related to the transaction between nodes102-1 and 102-5. In doing so, node 102-2 can receive a payment (e.g.,from node 102-1 and/or node 102-5) for facilitating the transaction.

In various embodiments, messages relating to transactions can be routedto the authorized nodes 102-1 and node 102-5 to facilitate themanagement of the blockchain. Nodes 102-1 and 102-5 can manage thecryptocurrency blockchain and can, therefore, know the current state ofthe blockchain. The blockchain managed by nodes 102-1 and 102-5 can bedistributed within mesh network 110 including, for example, a state ofthe blockchain. Nodes 102-1 and 102-5 may also provide access to remotenetworks and/or the Internet to facilitate communications between any ofnodes 102 and remote device operating outside of mesh network 110. Invarious embodiments, as shown in FIG. 1, the unauthorized nodes 102-2,102-3, and 102-4 can funnel or route all traffic, for example, any typeof communication or transactional information, to the authorized nodes102-1 and 102-5.

In various embodiments, mesh network 110 can operate without being underthe control of a central authority. Instead, mesh network 110 can befacilitated by peer nodes and/or several distributed authorized nodes(e.g., nodes 102-1 and 102-5) that manage a payment system (e.g.,cryptocurrency blockchain) that can be used to conduct transactions onmesh network 110, with other nodes on mesh network 110 routingtransactional related traffic to the authorized nodes to earn payments,and routing secure communications between nodes to also earn payment.Communications can be made secure using private and/or public keysassociated with generated cryptocurrency wallets as issued by theauthorized nodes as described herein. For example, the public and/orprivate keys associated with the cryptocurrency wallets can be used toencrypt and decrypt messages sent within the mesh network to maintainthe messages in a secure manner as described herein.

FIG. 2A illustrates an example of an operating environment 200 that maybe representative of some embodiments. As shown in FIG. 2A, network 210may include a plurality of nodes 202 a-y. In various embodiments, nodes202 a-y may be configured to transmit information to various other nodesof network 210. In some embodiments, network 210 may be a networkconfigured the same or similar to network 110.

Node 202 s may be an originating node seeking to transmit a packet orother information element to destination node 202 f. Node 202 s maygenerate a routing query to transmit the packet over network 210. Inexemplary embodiments, the routing query may include information thatmay be used by other nodes 202 a-y to decide on whether to act as anintermediary node. In some embodiments, routing query may include adestination node, a transmission value, and/or timing information (forinstance, a time window where at least a portion of the transmissionmust take place), quality information (for instance, error rates,service level information, and/or the like). In exemplary embodiments,the transmission value may include an offer amount that the network nodeoffers to pay to route the information to the at least one destination.For example, node 202 s may offer 2 units, tokens, dollars, or othervalue to transmit the packet to destination node 202 a.

The routing query may be broadcast to all or a portion of nodes 202 a-y.In some embodiments, the routing query may only be transmitted to asubset of nodes 202 a-y based on various factors, such as availability,originating node preference, and/or the like. Nodes 202 a-y receivingthe routing query may transmit a bid as bidding nodes for transmittingthe packet to the next node in the path. The transmission value and/orthe bid values may be set based on various factors, such as the cost toprocess (for instance, decryption and encryption) the packet and totransmit the packet to the next node, such as power consumption costs,electricity costs, and/or the like. In some embodiments, nodes 202 a-ymay automatically determine a threshold cost for transmission, which maybe used to automatically determine the bid value (plus a percentagemarkup, for example). Accordingly, an intermediary node may receivepayment for the work required for encryption and decryption of a packet.

In some embodiments, a bid may be based on data size, such as an offerto transmit a data size unit per unit (1 byte for 1/1000^(th) of acoin), time (for instance, a rate per millisecond to process the packetand/or transmit to the next node). Accordingly, nodes 202 a-y and/orgroups thereof may compete to be the cheapest node for processing apacket as it passes through network 210. In some embodiments, paths,regions, or other groups of nodes may establish a rate, for example,during a certain time period. For example, nodes 202 a-c may set anautomatic bid amount of 3 units to traverse this path.

In some embodiments, a bid value of a node 202 a-y may be static orsemi-static to save on resources (for instance, having to ping a node202 a-y for each transmission query). For example, nodes 202 a-y mayinclude a bid table that includes a record for one or more other nodes202 a-y. Each record may include a bid amount for a node 202 a-y, atimestamp to indicate the age of that bid amount, and/or an expirationtime for the bid amount. In some embodiments, bid amounts may beprovided to nodes 202 a-y on a push basis whenever a node 202 a-ychanges their default bid amount. In other embodiments, bid amounts maybe accessed on a pull basis, for example, responsive to a transmissionquery or when a bid amount has expired.

In various embodiments, node 202 s may receive one or more bids from oneor more of nodes 202 a-y and/or groups thereof. Node 202 s and nodes 202a-y may continue the bid/request process until a transmission value ismet. In general, nodes 202 a-y preferring security and anonymity overtransmission time may operate to accept bids that have the most nodes inorder to increase the layers of encryption to the destination node. Forexample, node 202 s may receive a first bid of 3 units from nodes 202a-y that leads to a path of 2 nodes and a second bid of 3 units thatleads to a path of 3 nodes. Node 202 s may select the second bid inorder to achieve more layers of encryption for transmission of thepacket. Accordingly, in some embodiments, the payment-based transmissionprocess may operate for an originating node as a secure process forpaying for encryption and, therefore, anonymity. In some embodiments,nodes 202 a-y may participate as intermediary nodes to obtain units orother funds. In various embodiments, nodes 202 a-y may purchase unitsusing the currency.

Referring now to FIG. 2B, therein are depicted as illustrativetransmission paths according to some embodiments. In the example ofFIGS. 2A and 2B, originating node 202 s may have accepted a bid bybidding nodes 202 r and 202 g to transmit a packet from originating node202 s to destination node 202 a to form path 220 a (bidding nodes 202 rand 202 g may be termed intermediary nodes once the path of the winningbid is selected). Each segment of path 220 a may be associated with asegment transaction value 230, which is the cost to send the informationalong that particular path. In some embodiments, there may only besegment transaction values 230 only for intermediary nodes 202 r and 202g. For example, there may be a segment transaction value 230 a to payfor intermediary node 202 r to handle the packet and segment transactionvalue 230 b to handle the packet. In some embodiments, destination node202 a may also be included in the transaction value, for example, withsegment transaction value 230 c. In the example of path 220 a, segmenttransaction value 230 a may be 0.5 units, segment transaction value 230b may be 1 unit, and segment transaction value 230 c may be 0.5 units.

In some embodiments, node 202 s may determine the path based on theintermediary nodes of the accepted bid. Node 202 s may encrypt thepacket with a number of layers that corresponds with the number of nodesin the path. For example, for path 220 a, node 202 s may encrypt thepacket with three layers: a first (outer) layer for node 202 r, a secondlayer for node 202 g, and a third layer for node 202 a. In variousembodiments, node 202 s may include the payment in the encrypted packet,for example, implemented via a wallet. In some embodiments, the walletmay be or may include a cryptocurrency or crypto-based wallet, such asBitcoin, Ethereum, or other block-based chain cryptocurrency. In variousembodiments, node 202 s may include the entire amount (for instance, 2units) in the encrypted packet. In some embodiments, the entire amountmay be included in the first encryption layer so that the firstintermediary node may access the payment.

In some embodiments, intermediary nodes 202 r and 202 g may operate toreceive the encrypted packet and decrypt the top layer of the packet toaccess the corresponding information. Unless the node is the destinationnode, the information may include the next node and the payment. Forexample, node 202 r may decrypt the encrypted packet and take thesegment transaction value 230 a of 0.5 units and access the next nodeinformation. Node 202 r may encrypt the packet for the next intermediarynode, node 202 g, with the remaining payment amount (1.5 units).Destination node 202 a may decrypt the packet to receive the datapayload (as well as any payment amount remaining).

Accordingly, the entire payment for the remaining processing may bepassed from node-to-node. For example, in a three-node path, the firstnode would receive the full payment, the second node would receive (fullpayment—node 1 payment), and the third node would receive (fullpayment—(node 1 payment+node 2 payment). In some embodiments, if a noderetains more than their allotted share of the payment, they may bepenalized. Non-limiting examples of penalties may include taking theover-amount (plus a penalty), being removed from network 210, beingdesignated as an unauthorized or untrusted node, and/or the like.

In another example illustrated in FIGS. 2A and 2B, originating node 202o may have broadcast a transmission query for routing a packet todestination node 202 f with a transmission value greater than therequest of node 202 a (for example, 3 units). Node 202 o may havereceived a bid that included path 220 b, with one additional nodecompared with path 220 a. Accordingly, the additional transmission value(1 unit) provided node 202 o with an additional node (and, therefore,encryption layer). In the example of path 220 b, segment transactionvalue 230 n may be 0.5 units, segment transaction value 230 o may be 1unit, segment transaction value 230 p may be 0.5 units, and segmenttransaction value 230 q may be 1 unit.

In some embodiments, an originating node may only have enough units toencrypt for only part of the path to the destination node. Accordingly,a packet may be encrypted for each hop until the originating node runsout of units. In various embodiments, a node failure process may beinitiated responsive to a node failure. For example, node 202 g of path202 a may fail or otherwise be unable to transmit a packet. In someembodiments, the node failure process may manage a failed node the sameor similar to a lost packet and/or a connection lost. In exemplaryembodiments, responsive to a failed node, the node failure process mayallocate a new node, allocate a new path, and/or reconnect and start anew path (or new section).

Included herein are one or more logic flows representative of exemplarymethodologies for performing novel aspects of the disclosedarchitecture. While, for purposes of simplicity of explanation, the oneor more methodologies shown herein are shown and described as a seriesof acts, those skilled in the art will understand and appreciate thatthe methodologies are not limited by the order of acts. Some acts may,in accordance therewith, occur in a different order and/or concurrentlywith other acts from that shown and described herein. For example, thoseskilled in the art will understand and appreciate that a methodologycould alternatively be represented as a series of interrelated states orevents, such as in a state diagram. Moreover, not all acts illustratedin a methodology may be required for a novel implementation. Blocksdesignated with dotted lines may be optional blocks of a logic flow.

A logic flow may be implemented in software, firmware, hardware, or anycombination thereof. In software and firmware embodiments, a logic flowmay be implemented by executable computer instructions stored on anon-transitory computer readable medium or machine-readable medium, suchas an optical, magnetic or semiconductor storage. The embodiments arenot limited in this context.

FIG. 3 illustrates an embodiment of a logic flow 300. Logic flow 300 maybe representative of some or all of the operations executed by one ormore embodiments described herein, such as nodes 102 of network 110and/or nodes 202 a-y of network 210. In some embodiments, logic flow 300may be representative of some or all of the operations of payment-basedtransmission process for an originating node according to someembodiments.

At block 302, logic flow 300 may determine a transmission destination.For example, node 202 s may determine data for transmission in the formof a data packet to be sent to destination node 202 a via network 210.Logic flow may determine a transmission value at block 304. For example,node 202 s may determine a cost it is willing to pay to transmit thedata packet(s) to node 202 a. The cost may be based on various factors,such as importance of data, distance of node 202 a, available funds,and/or the like.

Logic flow 300 may communicate the transmission request at block 306.For example, node 202 s may broadcast a transmission query to all or asubgroup of nodes 202 a-y of network 210. In some embodiments, node 202s may send the transmission query first to a preferred set of nodes 202a-y then, if no bids or no acceptable bids are received, may send orbroadcast to other nodes 202 a-y outside of this group. At block 308,logic flow 300 may receive bids. For example, node 202 s may receivebids indicating a bid amount a bidding node requires to transmit theinformation through the at least one bidding node on a path to or towarddestination node 202 a.

At block 310, logic flow 300 may determine whether any acceptable bidswere received. For example, an acceptable bid may include a bid at orbelow the transmission value that includes the largest number of nodes.In some embodiments, if an acceptable bid is received, logic flow 300may determine the path information at block 312. For example, node 202 smay determine path 220 a to node 202 a of the selected bid. In variousembodiments, node 202 s may add up the values of the bids to determine alongest path to destination node 202 a to arrive at the selected bid. Insome embodiments, other factors, such as transmission speed,transmission quality, and/or the like may also be considered as part ofthe bid process. For example, nodes 202 a-y and/or combinations thereofmay be weighted to select a path in the case of ties or other similarbid situations.

Logic flow 300 may generate a network transmission element at block 314.For example, node 202 a may generate an encrypted packet with a numberof encryption layers that equal the number of nodes in the transmissionpath. In some embodiments, the encrypted packet may include the payment,such as a cryptocurrency payment implemented via a wallet. At block 316,logic flow 300 may transmit the network transmission element to thefirst node in the path. For example, node 202 s may transmit theencrypted packet to node 202 r of path 220 a.

If logic flow 300 does not determine an acceptable bid at block 310,logic flow 300 may proceed to a default function. For example, logicflow 300 may return to block 304 to determine a different transmissionvalue and to try the bidding process again. In another example, logicflow 300 may inform the user that transmission via network 210 for thetransmission value has not been accepted. In a further example, logicflow 300 may transmit the packet using a default path (which may or maynot be encrypted), for example, using up the transmission value toencrypt the packet until the transmission value is used up.

FIG. 4 illustrates an embodiment of a logic flow 400. Logic flow 400 maybe representative of some or all of the operations executed by one ormore embodiments described herein, such as nodes 102 of network 110and/or nodes 202 a-y of network 210. In some embodiments, logic flow 400may be representative of some or all of the operations of payment-basedtransmission process for an intermediary node according to someembodiments.

At block 402, logic flow 400 may receive a network transmission element.For example, node 202 r may receive an encrypted packet from originatingnode 202 s. Logic flow 400 may receive a segment transmission value atblock 404. For example, node 202 r may decrypt the first encryptionlayer of the encrypted packet to receive the full payment value for thetransmission process. Node 202 r may take the amount apportioned to node202 r based on the accepted bid for the transmission process.

At block 406, logic flow 400 may determine the next destination. Forexample, node 202 r may access information decrypted from the firstencryption layer to determine the next node in the path (node 202 g).Logic flow 400 may transmit the network transmission element to the nextnode. For example, node 202 r may encrypt the packet with the remainingpayment amount and transmit the packet to node 202 g.

FIG. 5 illustrates an embodiment of a logic flow 500. Logic flow 500 maybe representative of some or all of the operations executed by one ormore embodiments described herein, such as nodes 102 of network 110and/or nodes 202 a-y of network 210. In some embodiments, logic flow 400may be representative of some or all of the operations of apayment-based transmission process according to some embodiments

At block 502, logic flow 500 may provide a routing query to transmitinformation over a network, the routing query comprising at least onedestination node for the information and a transmission value. Logicflow 500 may receive at least one bid from at least one bidding node inresponse to the routing query at block 504. Logic flow 500 may determinea path through the network to transmit the information at leastpartially anonymously based on the at least one bid that corresponds tothe transmission value at block 506. At block 508, logic flow 500 maytransmit the information at least partially anonymously via the pathwithin a network packet encrypted in a number of layers of encryptioncorresponding to a number of bidding nodes in the path.

FIG. 6 depicts a logical model 600 of an exemplary blockchain,consistent with disclosed embodiments. The blockchain may compriseblocks, such as blocks 601 a-601 d. Blocks may include messages, such asmessage 607 a-607 d. Generally, blocks may include a header, such asheaders 602 a-602 d, which uniquely identifies each block. The headers602 a-602 d may include a hash value generated by a hash function. Ahash function is any function that can be used to map input data ofarbitrary size to a hash value of a fixed size. For example, a headermay include at least one of the previous block's hash value, a hashvalue generated based on any messages in the block (e.g., a Merkleroot), and a timestamp. Consistent with disclosed embodiments, blocksadded to a blockchain described herein may satisfy at least one of aproof-of-work condition and a digital signature condition. For example,the headers 602 a-602 d may include a nonce chosen to ensure the headersatisfies the proof-of-work condition. As a non-limiting example, theproof-of-work condition may require the hash of the header fall within apredetermined range of values. As an additional example, the header maybe digitally signed with a cryptographic key of an authorized system,and the digital signature may be included in the header. This digitalsignature may be verified using an available key. The blocks may alsoinclude proof components, such as proof components 605 a-605 d. As anexample, the nonce can comprise the proof components 605.

FIG. 7 depicts a logical model of a message 607 stored in a blockchain(e.g., an element of blockchain depicted in FIG. 6), consistent withdisclosed embodiments. In some embodiments, message 607 may compriseindex information 703. In certain aspects, index information 703 maycomprise information identifying a user. For example, index information703 may be at least one of a full name, email address, phone number, orother non-sensitive personal information of the user. In variousaspects, index information 703 may include one or more references toearlier blocks in the private blockchain. For example, index information703 may include one or more references to one or more earlier blocksassociated with the same user. A reference may include, as anon-limiting example, a hash of a preceding block in the blockchainassociated with the same user. In some aspects, index information 703may be obfuscated or encrypted according to methods known to one ofskill in the art. For example, index information 703 may be encryptedwith a cryptographic key. As an additional example, index information703 may comprise a hash of the at least one of a full name, emailaddress, phone number, or other non-sensitive personal information ofthe user.

Message 607 may comprise additional information 705, consistent withdisclosed embodiments. The additional information 705 can be, forexample, metadata or other information related to a transactionconducted between nodes in mesh network 110 (e.g., may provide publickeys for certain nodes operating in mesh network 110). In variousaspects, additional information 705 may be obfuscated or encryptedaccording to methods known to one of skill in the art. Message 607 maycomprise authentication record 907, consistent with disclosedembodiments. In some aspects, authentication record 707 may compriseinformation enabling subsequent auditing of transactions. For example,authentication record 707 may identify at least one node of mesh network110. In some aspects, authentication record 707 may be obfuscated orencrypted according to methods known to one of skill in the art. Forexample, authentication record 707 may be encrypted with a cryptographickey.

Cryptographic keys may be used to encrypt elements of messages inblocks, consistent with disclosed embodiments. In some aspects, suchcryptographic keys may be associated with nodes of mesh network 110. Invarious aspects, at least some of the cryptographic keys may beassociated with authorized nodes. Corresponding cryptographic keys maybe available to decrypt the encrypted message elements, consistent withdisclosed embodiments. For example, when an element of a message in ablock is encrypted with a symmetric key, the same symmetric key may beavailable for decrypting the encrypted element. As another example, whenan element of a message in a block is encrypted with a private key, acorresponding public key may be available for decrypting the encryptedelement, or when an element of a message in a block is encrypted with apublic key, a corresponding private key may be available for decryptingthe encrypted element.

FIG. 8 illustrates a storage medium 800. Storage medium 800 mayrepresent an implementation of a storage device of any electronic deviceand/or computing device that may operate as a node within network 110and/or network 210. The storage medium 800 can comprise anynon-transitory computer-readable storage medium or machine-readablestorage medium. In various embodiments, the storage medium 800 cancomprise a physical article of manufacture. In various embodiments,storage medium 800 can store computer-executable instructions, such ascomputer-executable instructions to implement one or more of logic flowsor operations described herein, such as logic flow 300, logic flow 400,and/or logic flow 500. In various embodiments, storage medium 800 canstore computer-executable instructions, such as computer-executableinstructions to implement any of the functionality described herein inrelation to any described device, system, or apparatus. Examples of acomputer-readable storage medium or machine-readable storage medium caninclude any tangible media capable of storing electronic data. Examplesof computer-executable instructions can include any type of computerreadable code.

FIG. 9 illustrates a computing architecture 900 that can implementvarious embodiments described herein. In various embodiments, thecomputing architecture 900 can comprise or be implemented as part of anelectronic device and/or a computing device. In various embodiments, thecomputing architecture 900 can represent an implementation of anyconstituent component of mesh network 110 and/or network 210. One ormore of the constituent components of the computing architecture 900,and/or any constituent component of mesh network 110 and/or network 210,can be implemented in hardware, software, or any combination thereofincluding implementation based on a storage device (e.g., a memory unit)and logic, at least a portion of which is implemented in circuitry andcoupled to the storage device. The logic can be or can include aprocessor or controller component.

The computing architecture 900 can include various common computingelements, such as one or more processors, multi-core processors,co-processors, memory units, chipsets, controllers, peripherals,interfaces, oscillators, timing devices, video cards, audio cards,multimedia input/output (I/O) components, power supplies, and so forth.

As shown in FIG. 9, the computing architecture 900 can comprise acomputer 902 having a processing unit 904, a system memory 906 and asystem bus 908. The processing unit 904 can be any of variouscommercially available processors or can be a specially designedprocessor.

The system bus 908 provides an interface for system componentsincluding, but not limited to, an interface between the system memory906 and the processing unit 904. The system bus 908 can be any ofseveral types of bus structure that may further interconnect to a memorybus (with or without a memory controller), a peripheral bus, and a localbus using any of a variety of commercially available bus architectures.The system memory 906 can include any type of computer-readable storagemedia including any type of volatile and non-volatile memory. Thecomputer 902 can include any type of computer-readable storage mediaincluding an internal (or external) hard disk drive (HDD) 914. Invarious embodiments, the computer 902 can include any other type of diskdrive such as, for example, a magnetic floppy disk and/or an opticaldisk drive. The HDD 914 can be connected to the system bus 908 by a HDDinterface 924. In various embodiments, any number of program modules canbe stored in the drives and memory units 906 and/or 914 such as, forexample, an operating system 930, one or more application programs 932,other program modules 934, and program data 936.

A user can enter commands and information into the computer 902 throughone or more wired/wireless input devices such as, for example, akeyboard 938 and a pointing device, such as a mouse 940. These and otherinput devices can be connected to the processing unit 904 through aninput device interface 942 that is coupled to the system bus 908. Amonitor 944 or other type of display device can also be connected to thesystem bus 908 via an interface, such as a video adaptor 946. Themonitor 944 may be internal or external to the computer 902.

The computer 902 may operate in a networked environment using logicalconnections via wired and/or wireless communications to one or moreremote computers, such as a remote computer 948. The remote computer 948can be a workstation, a server computer, a router, a personal computer,portable computer, microprocessor-based entertainment appliance, asmartphone, a tablet, a peer device or other common network node, andtypically includes many or all of the elements described relative to thecomputer 902. The logical connections depicted include wired and/orwireless connectivity to networks 952 such as, for example, a local areanetwork (LAN) and/or larger networks, for example, a wide area network(WAN). Networks 952 can provide connectivity to a global communicationsnetwork such as, for example, the Internet. A network adapter 956 canfacilitate wired and/or wireless communications to the networks 952. Thecomputer 902 is operable to communicate over any known wired or wirelesscommunication technology, standard, or protocol according to any knowncomputer networking technology, standard, or protocol.

The following include non-limiting example embodiments:

Example 1 includes a network node, comprising a storage device; andlogic, at least a portion of the logic implemented in circuitry coupledto the storage device, the logic to: provide a routing query to transmitinformation over a network, the routing query comprising at least onedestination node for the information and a transmission value, thetransmission value comprising an offer amount that the network nodeoffers to pay to route the information to the at least one destination,receive at least one bid from at least one bidding node in response tothe routing query, determine a path through the network to transmit theinformation at least partially anonymously based on the at least one bidthat corresponds to the transmission value, and transmit the informationat least partially anonymously via the path within a network packetencrypted in a number of layers of encryption corresponding to a numberof intermediary nodes in the path, each intermediary node of the pathallowing for at least one layer of encryption for the network packet fora cost.

Example 2 includes network node of Example 1, the at least one bidcomprising a bid amount that the at least one bidding node requires totransmit the information through the at least one bidding node.

Example 3 includes network node of Example 1, the logic to receive aplurality of bids, and determine the path to include a largest number ofbidding nodes in which the value of the plurality of bids is equal to orless than the transmission value.

Example 4 includes network node of Example 1, the logic to broadcast therouting query to a subset of a plurality of nodes of the networkselected based on at least one factor.

Example 5 includes network node of Example 1, the path comprising aplurality of intermediary nodes, each intermediary node operative todetermine decryption information via decrypting one of the number oflayers of encryption, the decryption information indicating a nextintermediary node in the path.

Example 6 includes network node of Example 1, the path comprising aplurality of intermediary nodes, each of the plurality of intermediarynodes to receive payment responsive to decrypting one of the layers ofencryption and transmitting the information to a next intermediary nodein the path.

Example 7 includes network node of Example 1, the logic to transmit apayment to a first intermediary node in the path, the payment comprisingan entirety of the cost to transmit the information to the at least onedestination node via the path.

Example 8 includes network node of Example 7, the logic to transmit thepayment to cause the first intermediary node to receive a first portionof the payment corresponding to a bid associated with the first biddingnode, the first intermediary node to transmit a remainder of the paymentto a second intermediary node in the path.

Example 9 includes network node of Example 7, the logic to encrypt thepayment in the network packet for receipt by a cryptocurrency wallet ofan intermediary node.

Example 10 includes computer-implemented method, comprising, via aprocessor of a network node providing a routing query to a plurality ofbidding nodes on a network, the routing query comprising at least onedestination node for the information and a transmission value, thetransmission value comprising an offer amount that the network nodeoffers to pay to route the information to the at least one destination,and operative to solicit bids to transmit the information from thenetwork node to the at least one destination node over the network;receiving a plurality of bids from the plurality of bidding nodes;accepting the at least one bid that corresponds to the transmissionvalue; determining a path to the at least one destination node via theplurality of bidding nodes associated with the at least one bid;encrypting the information in a network packet in a number of layers ofencryption corresponding to a number of intermediary nodes in the path;and causing the transmission of the network packet through the path,each intermediary node of the path allowing for at least one layer ofencryption for the network packet for a cost.

Example 11 includes computer-implemented method of Example 10, the atleast one bid comprising a bid amount that the at least one intermediarynode requires to transmit the information through the at least oneintermediary node.

Example 12 includes computer-implemented method of Example 10,comprising determining the path to include a largest number of theplurality of intermediary nodes in which the value of the plurality ofbids is equal to or less than the transmission value.

Example 13 includes computer-implemented method of Example 10,comprising broadcasting the routing query to a subset of a plurality ofnodes of the network selected based on at least one factor.

Example 14 includes computer-implemented method of Example 10, eachintermediary node of the path operative to determine decryptioninformation via decrypting one of the number of layers of encryption,the decryption information indicating a next intermediary node in thepath.

Example 15 includes computer-implemented method of Example 10, eachintermediary node of the path to receive payment responsive todecrypting one of the layers of encryption and transmitting theinformation to a next intermediary node in the path.

Example 16 includes computer-implemented method of Example 10,comprising transmitting a payment to a first intermediary node in thepath, the payment comprising an entirety of the cost to transmit theinformation to the at least one intermediary node via the path.

Example 17 includes computer-implemented method of Example 16,comprising transmitting the payment to cause the first intermediary nodeto receive a first portion of the payment corresponding to a bidassociated with the first intermediary node, the first intermediary nodeto transmit a remainder of the payment to a second intermediary node inthe path.

Example 18 includes computer-implemented method of Example 16,comprising encrypting the payment in the network packet for receipt by acryptocurrency wallet of an intermediary node.

Example 19 includes at least one non-transitory computer-readable mediumcomprising a set of instructions that, in response to being executed ona network node, cause the network node to provide a routing query totransmit information over a network, the routing query comprising atleast one destination node for the information and a transmission value,the transmission value comprising an offer amount that the network nodeoffers to pay to route the information to the at least one destination;receive at least one bid from at least one bidding node in response tothe routing query; determine a path through the network to transmit theinformation at least partially anonymously based on the at least one bidthat corresponds to the transmission value; and transmit the informationat least partially anonymously through the network via a network packetencrypted in a number of layers of encryption corresponding to a numberof intermediary nodes in the path, each intermediary node of the pathallowing for at least one layer of encryption for the network packet fora cost.

Example 20 includes the at least one non-transitory computer-readablemedium of Example 19, the set of instructions, in response to beingexecuted on the network node, cause the network node to receive aplurality of bids; and determine the path to include a largest number ofintermediary nodes in which the value of the plurality of bids is equalto or less than the transmission value.

Various embodiments described herein may comprise one or more elements.An element may comprise any structure arranged to perform certainoperations. Each element may be implemented as hardware, software, orany combination thereof. Any reference to “one embodiment” or “anembodiment” means that a particular feature, structure, orcharacteristic described in connection with the embodiment is includedin at least one embodiment. The appearances of the phrases “in oneembodiment,” “in some embodiments,” and “in various embodiments” invarious places in the specification are not necessarily all referring tothe same embodiment.

In various instances, for simplicity, well-known operations, components,and circuits have not been described in detail so as not to obscure theembodiments. It can be appreciated that the specific structural andfunctional details disclosed herein may be representative and do notnecessarily limit the scope of the embodiments.

Certain embodiments of the present invention were described above. Itis, however, expressly noted that the present invention is not limitedto those embodiments, but rather the intention is that additions andmodifications to what was expressly described herein are also includedwithin the scope of the invention. Moreover, it is to be understood thatthe features of the various embodiments described herein were notmutually exclusive and can exist in various combinations andpermutations, even if such combinations or permutations were not madeexpress herein, without departing from the spirit and scope of theinvention. In fact, variations, modifications, and other implementationsof what was described herein will occur to those of ordinary skill inthe art without departing from the spirit and the scope of theinvention. As such, the invention is not to be defined only by thepreceding illustrative description.

The invention claimed is:
 1. A peer node of a mesh network, comprising:a storage device; and logic, at least a portion of the logic implementedin circuitry coupled to the storage device, the logic to: broadcast arouting query to a plurality of peer nodes of the mesh network totransmit information over the mesh network, the routing query indicatinga destination peer node for the information, and the routing querycomprising a transmission value indicating an offer amount that the peernode offers to pay to route the information to the at least onedestination peer node, receive at least one bid from at least onebidding peer node of the plurality of peer nodes in response to therouting query, accept the at least one bid and determine a path from thepeer node, through the at least one bidding peer node, and to thedestination peer node to transmit the information from the peer node tothe destination peer node based on the at least one bid, and transmitthe information to the destination peer node via the at least onebidding peer node through the path, wherein the information istransmitted at least partially anonymously via the path within a networkpacket encrypted in a number of layers of encryption corresponding to anumber of nodes in the path, each node of the path allowing for at leastone layer of encryption for the network packet for a cost.
 2. The peernode of claim 1, the at least one bid comprising a bid amount that theat least one bidding node requires to transmit the information throughthe at least one bidding node.
 3. The peer node of claim 1, at least aportion of the plurality of peer nodes to maintain a blockchain for acryptocurrency for managing payment of the at least one bid to the atleast one bidding peer node.
 4. The peer node of claim 1, the logic to:receive a plurality of bids, and determine the path to include a largestnumber of bidding nodes in which the value of the plurality of bids isequal to or less than the transmission value.
 5. The peer node of claim1, each of the bidding nodes in the path to receive payment responsiveto decrypting one of the layers of encryption and transmitting theinformation to a next node in the path.
 6. A computer-implementedmethod, comprising, via a processor of a network node: broadcasting arouting query to a plurality of peer nodes of a mesh network to transmitinformation over the mesh network, the routing query indicating adestination peer node for the information, and the routing querycomprising a transmission value indicating an offer amount that the peernode offers to pay to route the information to the at least onedestination peer node; receiving at least one bid from at least onebidding peer node of the plurality of peer nodes in response to therouting query; accepting the at least one bid and determining a pathfrom the peer node, through the at least one bidding peer node, and tothe destination peer node to transmit the information from the peer nodeto the destination peer node based on the at least one bid; andtransmitting the information to the destination peer node via the atleast one bidding peer node through the path, wherein the information istransmitted at least partially anonymously via the path within a networkpacket encrypted in a number of layers of encryption corresponding to anumber of nodes in the path, each node of the path allowing for at leastone layer of encryption for the network packet for a cost.
 7. Thecomputer-implemented method of claim 6, the at least one bid comprisinga bid amount that the at least one bidding node requires to transmit theinformation through the at least one bidding node.
 8. Thecomputer-implemented method of claim 6, at least a portion of theplurality of peer nodes to maintain a blockchain for a cryptocurrencyfor managing payment of the at least one bid to the at least one biddingpeer node.
 9. The computer-implemented method of claim 6, comprising:receiving a plurality of bids; and determining the path to include alargest number of bidding nodes in which the value of the plurality ofbids is equal to or less than the transmission value.
 10. Thecomputer-implemented method of claim 6, each of the bidding nodes in thepath to receive payment responsive to decrypting one of the layers ofencryption and transmitting the information to a next node in the path.11. At least one non-transitory computer-readable medium comprising aset of instructions that, in response to being executed on a networknode, cause a peer node of a mesh network to: broadcast a routing queryto a plurality of peer nodes of the mesh network to transmit informationover the mesh network, the routing query indicating a destination peernode for the information, and the routing query comprising atransmission value indicating an offer amount that the peer node offersto pay to route the information to the at least one destination peernode; receive at least one bid from at least one bidding peer node ofthe plurality of peer nodes in response to the routing query; accept theat least one bid and determine a path from the peer node, through the atleast one bidding peer node, and to the destination peer node totransmit the information from the peer node to the destination peer nodebased on the at least one bid; and transmit the information to thedestination peer node via the at least one bidding peer node through thepath, wherein the information is transmitted at least partiallyanonymously via the path within a network packet encrypted in a numberof layers of encryption corresponding to a number of nodes in the path,each node of the path allowing for at least one layer of encryption forthe network packet for a cost.
 12. The at least one non-transitorycomputer-readable medium of claim 11, the at least one bid comprising abid amount that the at least one bidding node requires to transmit theinformation through the at least one bidding node.
 13. The at least onenon-transitory computer-readable medium of claim 11, the set ofinstructions, in response to being executed on the network node, to:receive a plurality of bids, and determine the path to include a largestnumber of bidding nodes in which the value of the plurality of bids isequal to or less than the transmission value.
 14. The at least onenon-transitory computer-readable medium of claim 11, each of the biddingnodes in the path to receive payment responsive to decrypting one of thelayers of encryption and transmitting the information to a next node inthe path.